Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems
نویسندگان
چکیده
منابع مشابه
Gardens of Eden and Fixed Points in Sequential Dynamical Systems
1Los Alamos National Laboratory, P.O. Box 1663, MS M997, Los Alamos, NM 87545. Email: barrett, marathe, p-tosic @lanl.gov. The work is supported by the U.S. Department of Energy under contract W-7405-ENG-36. 2Department of Computer Science, University at Albany SUNY, Albany, NY 12222. Email: hunt, ravi, djr, res @cs.albany.edu. Supported by a grant from Los Alamos National Laboratory and by NSF...
متن کاملCounting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs
We study counting various types of configurations in certain classes of graph automata viewed as discrete dynamical systems. The graph automata models of our interest are Sequential and Synchronous Dynamical Systems (SDSs and SyDSs, respectively). These models have been proposed as a mathematical foundation for a theory of large-scale simulations of complex multi-agent systems. Our emphasis in ...
متن کاملPredecessor and Permutation Existence Problems for Sequential Dynamical Systems
1Basic and Applied Simulation Science (CCS-5) and National Infrastructure Simulation and Analysis Center (NISAC), Los Alamos National Laboratory, P.O. Box 1663, MS M997, Los Alamos, NM 87545. Email: {barrett, marathe}@lanl.gov. The work is supported by the U.S. Department of Energy under contract W-7405-ENG-36. 2Department of Computer Science, University at Albany SUNY, Albany, NY 12222. Email:...
متن کاملOn the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs
We study counting various types of configurations in certain classes of graph automata viewed as discrete dynamical systems. The graph automata models of our interest are Sequential and Synchronous Dynamical Systems (SDSs and SyDSs, respectively). These models have been proposed as the mathematical foundation for a theory of large-scale simulations of complex multi-agent systems. Our emphasis i...
متن کاملAncestors, descendants, and gardens of Eden in reaction systems
This paper analyses several problems related to finding and counting ancestor and descendant states, as well as gardens of Eden (i.e., states without predecessors) in reaction systems. The focus is on the complexity of finding and counting preimages and ancestors that are minimal with respect to cardinality. It turns out that the problems concerning gardens of Eden seem to require the presence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2019
ISSN: 1076-2787,1099-0526
DOI: 10.1155/2019/6280960